Empirical Evaluation of the Asymptotic Behavior of the Analysis Complexity of Hard Random 3-CNF Formulas

This paper continued the study of complexity behavior satisfiability analysis hard random formulas given in conjunctive normal form (CNF). In 3-CNF formula, each clause contains three literals logical variables. The number variables formula is N. this paper, SAT solver improved by introducing equality reduction and pure literal identification procedures. improvement reduced exponent (with base 2) from N/20.86 to N/21.41 with an R=4.6 ratio clauses results show that efficiency procedure decreases as R increases. An important part empirical estimation algorithmic problem large proposed method gives a convenient lower bound on for formulas. We estimated range N=256÷8192. exponential dependence N at fixed value demonstrated range.